#include <iostream>
using namespace std;

#include <string>
#include <vector>

class Solution 
{
public:
    int minimumDeleteSum(string s1, string s2) 
    {
        int m = s1.size();
        int n = s2.size();
        vector<vector<int>> dp(m + 1, vector<int>(n + 1));

        for (int i = 1; i <= m; ++i) 
        {
            dp[i][0] = dp[i - 1][0] + s1[i - 1];
        }
        for (int j = 1; j <= n; ++j) 
        {
            dp[0][j] = dp[0][j - 1] + s2[j - 1];
        }
        for (int i = 1; i <= m; i++) 
        {
            char c1 = s1[i - 1];
            for (int j = 1; j <= n; j++) 
            {
                char c2 = s2[j - 1];
                if (c1 == c2) 
                {
                    dp[i][j] = dp[i - 1][j - 1];
                } 
                else 
                {
                    dp[i][j] = min(dp[i - 1][j] + s1[i - 1], dp[i][j - 1] + s2[j - 1]);
                }
            }
        }

        return dp[m][n];
    }
};

int main()
{
    string s1 = "sea", s2 = "eat";

    cout << Solution().minimumDeleteSum(s1, s2) << endl;

    return 0;
}


